全文获取类型
收费全文 | 23841篇 |
免费 | 1692篇 |
国内免费 | 1081篇 |
专业分类
化学 | 1526篇 |
晶体学 | 30篇 |
力学 | 2565篇 |
综合类 | 310篇 |
数学 | 19630篇 |
物理学 | 2553篇 |
出版年
2024年 | 34篇 |
2023年 | 238篇 |
2022年 | 348篇 |
2021年 | 526篇 |
2020年 | 512篇 |
2019年 | 537篇 |
2018年 | 608篇 |
2017年 | 704篇 |
2016年 | 666篇 |
2015年 | 505篇 |
2014年 | 1034篇 |
2013年 | 1672篇 |
2012年 | 1230篇 |
2011年 | 1215篇 |
2010年 | 1114篇 |
2009年 | 1474篇 |
2008年 | 1517篇 |
2007年 | 1598篇 |
2006年 | 1363篇 |
2005年 | 1131篇 |
2004年 | 940篇 |
2003年 | 985篇 |
2002年 | 863篇 |
2001年 | 689篇 |
2000年 | 703篇 |
1999年 | 584篇 |
1998年 | 570篇 |
1997年 | 521篇 |
1996年 | 372篇 |
1995年 | 366篇 |
1994年 | 273篇 |
1993年 | 228篇 |
1992年 | 226篇 |
1991年 | 185篇 |
1990年 | 154篇 |
1989年 | 102篇 |
1988年 | 90篇 |
1987年 | 81篇 |
1986年 | 81篇 |
1985年 | 110篇 |
1984年 | 102篇 |
1983年 | 40篇 |
1982年 | 53篇 |
1981年 | 45篇 |
1980年 | 36篇 |
1979年 | 52篇 |
1978年 | 34篇 |
1977年 | 43篇 |
1976年 | 26篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
101.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
102.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
103.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
104.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
105.
Riad Hassani Patrick Hild Ioan Ionescu 《Mathematical Methods in the Applied Sciences》2004,27(1):47-67
We consider the Signorini problem with Coulomb friction in elasticity. Sufficient conditions of non‐uniqueness are obtained for the continuous model. These conditions are linked to the existence of real eigenvalues of an operator in a Hilbert space. We prove that, under appropriate conditions, real eigenvalues exist for a non‐local Coulomb friction model. Finite element approximation of the eigenvalue problem is considered and numerical experiments are performed. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
106.
L. E. Payne P. W. Schaefer J. C. Song 《Mathematical Methods in the Applied Sciences》2004,27(17):2045-2053
Energy bounds are derived for Dirichlet type boundary value problems for the Navier–Stokes and Stokes equations when a combination of the solution values initially and at a later time is prescribed. The bounds are obtained by means of a differential inequality and imply uniqueness and continuous data dependence of the solutions for a range of values of the parameter in the non‐standard auxiliary condition. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
107.
We study the complex Ginzburg–Landau equation with zero Neumann boundary conditions on a finite interval and establish that this boundary problem (with suitably chosen parameters) has countably many stable two-dimensional self-similar tori. The case of periodic boundary conditions is also investigated. 相似文献
108.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
109.
110.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献